!"#$%$&'( *+"#'%$,+-+. /012&3,45$%,3 '-6 /012&3,47'32% 2.''emiirical'results'on'the'obl Jectslfirst'debate'
نویسندگان
چکیده
In this paper, results of an empirical comparison of objects-first vs. objects-later are presented and discussed. The study was carefully designed to align the two approaches so that the comparison is focused on the main difference between the two approaches; that is the different sequence in which topics are taught: object oriented topics from the beginning or not. The study with duration of one year was carried out in a secondary school. In the end, both groups showed the same increase in learning gain, but perceived the difficulty of topics differently. We discuss study design, results and pedagogical implications. Categories' and' Su34ect' Descri7tors:' K3.2 [Com7uters' :' Education]: Computer and Information Science Education – !"#$%&'( *!+',!' '-%!.&+",/ +,0"(#.&+", *1*&'#* '-%!.&+",.' General'Terms:'Experimentation, Human Factors.'
منابع مشابه
Adaptive Job Scheduling Via Predictive Job Resource Allocation
#$%&'%('! )*+! ,-./'012&3! 0,/,! ,$%$2-! )*+! ,24/,! 5.2-.! 1%-6,! 71/82+212$9! (/3%('2&3! -.%&32&3!1*%'!2&!$./!,9,$/:!%&'!7(%3:/&$%$2*&!.%&'12&3;!<'%=$2>/!(/,*0(-/!%11*-%$2*&!2,! 6&*5&! $*! =(*>2'/! $./! 71/82+212$9! &//'/'! $*! *+$%2&! +/$$/(! (/,=*&,/! $2:/,! 0&'/(! ,0-.! -*&'2$2*&,;! ?/! =(/,/&$! %! ,-./'012&3! %==(*%-.! @#ABCBDEF! 5.2-.! '/-2'/,! (/,*0(-/! %11*-%$2*&!%$!)*+!,$%($!$2:/!%&'!...
متن کاملLarge Chromatic Number and Ramsey Graphs
Let Q(n, χ) denote the minimum clique size an n-vertex graph can have if its chromatic number is χ . Using Ramsey graphs we give an exact, albeit implicit, formula for the case χ ≥ (n + 3)/2.
متن کاملHelly Numbers of Polyominoes
We define the Helly number of a polyomino P as the smallest number h such that the h-Helly property holds for the family of symmetric and translated copies of P on the integer grid. We prove the following: (i) the only polyominoes with Helly number 2 are the rectangles, (ii) there does not exist any polyomino with Helly number 3, (iii) there exist polyminoes of Helly number k for any k 6= 1, 3.
متن کاملHardness of approximation for crossing number
We show that, if P6=NP, there is a constant c0 > 1 such that there is no c0approximation algorithm for the crossing number, even when restricted to 3-regular graphs.
متن کاملA tight Analysis of Brown-Baker-Katseff Sequences for Online Strip Packing
We study certain adversary sequences for online strip packing which were first designed and investigated by Brown, Baker and Katseff (Acta Inform. 18:207– 225) and determine the optimal competitive ratio for packing such Brown-BakerKatseff sequences online. As a byproduct of our result, we get a new lower bound of ρ ≥ 3/2 +√33/6 ≈ 2.457 for the competitive ratio of online strip packing.
متن کامل